منابع مشابه
Control of systems in Lure form over erasure channel
In this paper, we study the problem of control of discrete-time nonlinear systems in Lure form over erasure channels at the input and output. The input and output channel uncertainties are modeled as Bernoulli random variables. The main results of this paper provide sufficient condition for the mean square exponential stability of the closed loop system expressed in terms of statistics of chann...
متن کاملOptimal Codes for the Burst Erasure Channel
We make the simple observation that the erasure burst correction capability of any (n, k) code can be extended to arbitrary lengths above n with the use of a block interleaver, and discuss nuances of this property when channel symbols are over GF(p) and the code is defined over GF(p ), J > 1. The results imply that maximum distance separable codes (e.g., Reed-Solomon) offer optimal burst erasur...
متن کاملOptimal Coding for the Erasure Channel with Arbitrary Alphabet Size
An erasure channel with a fixed alphabet size q, where q ≫ 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure channel, the error exponent of MDS codes are compared with that of random codes and linear random codes...
متن کاملOptimal Rate Irregular LDPC Codes in Binary Erasure Channel
In this paper, we design the optimal rate capacity approaching irregular Low-Density ParityCheck code ensemble over Binary Erasure Channel, by using practical Semi-Definite Programming approach. Our method does not use any relaxation or any approximate solution unlike previous works. Our simulation results include two parts; first, we present some codes and their degree distribution functions t...
متن کاملJoint Cache-Channel Coding over Erasure Broadcast Channels
We consider a cache-aided communications system in which a transmitter communicates with many receivers over an erasure broadcast channel. The system serves as a basic model for communicating on-demand content during periods of high network congestion, where some content can be preplaced in local caches near the receivers. We formulate the cacheaided communications problem as a joint cache-chan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.157